A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

强爆轰驱动超高速碎片发射装置设计因素分析

为了得到发射装置设计因素和超高速碎片性能间的关系,考虑了药型罩的材料、炸药种类、装药长径比、药型罩的锥角、药型罩的厚度、药型罩顶部靠近装药侧的曲率半径等设计因素,采用AUTODYNTM,结合正交试验,对超高速碎片的发射过程进行数值模拟。结果表明,3种发射装置结构分别可以提供质量为1. 533 g的紫铜碎片、速度为11. 649 km/s的铝碎片、动能为85. 6 k J的铝碎片; 2种发射装置结构均可以提供质量大于1 g、速度高于11 km/s的密实结构圆柱状碎片。验证了仿真方法的可信性,对影响碎片性能的设计因素进行了分析、排序,并得到了这些设计因素与碎片质量、速度、动能的关系。     

分布式系统设计中的互斥问题

介绍了互斥问题的基本概念,并针对分布式系统设计中的互斥问题分析了非基于令牌和基于令牌的两种解决方案.通过对典型算法的分析,有助于对分布式系统形成可操作的数学模型.     

正态总体下分布参数的Bayes序贯估计

论述正态总体分布参数的序贯估计和Bayes序贯估计问题。在Stein的双子样序贯估计的基础上 ,构造了Bayes双子样序贯估计 ,并作了剖析。此外 ,为了适应当前试验场地“试试看看 ,看看试试”的试验分析和鉴定的需要 ,给出了以序贯Bayes检验为基本出发点 ,使检验和序贯估计相联合的分析方法     

方差分量的Bayes二次无偏估计及可容许估计的非负性

对于有P 个方差分量的线性模型,本文导出了方差分量线性函数的Bayes 不变二次无偏估计的显示表达式,证明了Bayes 不变二次无偏估计类形成了可容许的不变二次无偏估计的完全类。在可容许的不变二次无偏估计类中,讨论了非负参数函数的非负估计问题,给出了可容许的非负定估计存在的充要条件。     

一种新的自变量选择准则

本文提出了一种着眼于提高回归系数估值精度的自变量选取准则,同时给出了相应的算法。     

坦克火控系统机动目标的自适应滤波与自适应解命中问题

在非制导火控系统中,为实现目标信息的自适应滤波与自适应解命中问题,机动目标模型应能实时识别,并要适应工作周期的各种变化。本文提出了“参数辨识模型”,首次完全满足了上述要求。     

一种实用的有线电视加解扰方案

在分析了电视加扰技术中的模拟加扰方式和数字加扰方式后,对数字加扰时基处理中的行旋转、行置换、行变换等方法做了详细分析;为了保护有线电视加扰系统的安全,采用了随机数的产生、数据的加密等技术。最后详细介绍了一个包括加、解扰系统和用户控制的实验系统     

舰炮武器系统的基线修正分析

本文建立了基线修正误差分析的数学模型,并对舰炮火控系统中应用的传统的近似基线修正方法进行了深入的分析。通过分析,作者指出：在现代中、小口径舰炮火控系统中,不能再沿用传统的近似基线修正方法,必须进行精确的基线修正。